Search results for "binary [black hole]"
showing 10 items of 170 documents
Witness computation for solving geometric constraint systems
2014
International audience; In geometric constraint solving, the constraints are represented with an equation system F(U, X) = 0, where X denotes the unknowns and U denotes a set of parameters. The target solution for X is noted XT. A witness is a couple (U_W, X_W) such that F(U_W, X_W) = 0. The witness is not the target solution, but they share the same combinatorial features, even when the witness and the target lie on two distinct connected components of the solution set of F(U, X) = 0. Thus a witness enables the qualitative study of the system: the detection of over- and under-constrained systems, the decomposition into irreducible subsystems, the computation of subsystems boundaries. This …
Balancing and clustering of words in the Burrows–Wheeler transform
2011
AbstractCompression algorithms based on Burrows–Wheeler transform (BWT) take advantage of the fact that the word output of BWT shows a local similarity and then turns out to be highly compressible. The aim of the present paper is to study such “clustering effect” by using notions and methods from Combinatorics on Words.The notion of balance of a word plays a central role in our investigation. Empirical observations suggest that balance is actually the combinatorial property of input word that ensure optimal BWT compression. Moreover, it is reasonable to assume that the more balanced the input word is, the more local similarity we have after BWT (and therefore the better the compression is).…
On a multiplication and a theory of integration for belief and plausibility functions
1987
Abstract Belief and plausibility functions have been introduced as generalizations of probability measures, which abandon the axiom of additivity. It turns out that elementwise multiplication is a binary operation on the set of belief functions. If the set functions of the type considered here are defined on a locally compact and separable space X , a theorem by Choquet ensures that they can be represented by a probability measure on the space containing the closed subsets of X , the so-called basic probability assignment. This is basic for defining two new types of integrals. One of them may be used to measure the degree of non-additivity of the belief or plausibility function. The other o…
Construction of chaotic dynamical system
2010
The first‐order difference equation xn+ 1 = f(xn ), n = 0,1,…, where f: R → R, is referred as an one‐dimensional discrete dynamical system. If function f is a chaotic mapping, then we talk about chaotic dynamical system. Models with chaotic mappings are not predictable in long‐term. In this paper we consider family of chaotic mappings in symbol space S 2. We use the idea of topological semi‐conjugacy and so we can construct a family of mappings in the unit segment such that it is chaotic. First published online: 09 Jun 2011
Spatial Search on Grids with Minimum Memory
2015
We study quantum algorithms for spatial search on finite dimensional grids. Patel et al. and Falk have proposed algorithms based on a quantum walk without a coin, with different operators applied at even and odd steps. Until now, such algorithms have been studied only using numerical simulations. In this paper, we present the first rigorous analysis for an algorithm of this type, showing that the optimal number of steps is $O(\sqrt{N\log N})$ and the success probability is $O(1/\log N)$, where $N$ is the number of vertices. This matches the performance achieved by algorithms that use other forms of quantum walks.
Uncountable Realtime Probabilistic Classes
2018
We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same result for double logarithmic space, which is also tight. When replacing the work tape with a few counters, we can still achieve similar results for unary linear-space two-counter automata, unary sublinear-space three-counter automata, and non-unary sublinear-space two-counter automata. We also show how to slightly improve the sublinear-space constructions by using more counters.
A Periodicity Theorem on Words and Applications
1995
We prove a periodicity theorem on words that has strong analogies with the Critical Factorization theorem and we show three applications of it.
Filtering of Spontaneous and Low Intensity Emotions in Educational Contexts
2015
Affect detection is a challenging problem, even more in educational contexts, where emotions are spontaneous and usually subtle. In this paper, we propose a two-stage detection approach based on an initial binary discretization followed by a specific emotion prediction stage. The binary classification method uses several distinct sources of information to detect and filter relevant time slots from an affective point of view. An accuracy close to 75% at detecting whether the learner has felt an educationally relevant emotion on 20 second time slots has been obtained. These slots can then be further analyzed by a second classifier, to determine the specific user emotion.
Synthesis and Spectroscopic Properties of Silica−Dye−Semiconductor Nanocrystal Hybrid Particles
2010
We prepared silica-dye-nanocrystal hybrid particles and studied the energy transfer from semiconductor nanocrystals (= donor) to organic dye molecules (= acceptor). Multishell CdSe/CdS/ZnS semiconductor nanocrystals were adsorbed onto monodisperse Stöber silica particles with an outer silica shell of thickness 2-23 nm containing organic dye molecules (Texas Red). The thickness of this dye layer has a strong effect on the energy transfer efficiency, which is explained by the increase in the number of dye molecules homogeneously distributed within the silica shell, in combination with an enhanced surface adsorption of nanocrystals with increasing dye amount. Our conclusions were underlined by…
2-(N,N-Diethylaminomethyl)-6,7-trihydroquinolinyl-8-ylideneamine-Ni(ii) chlorides: application in ethylene dimerization and trimerization
2020
A series of Ni(II) complexes with the general formula [2-((NEt2)Me)-8-{N(Ar)}C9H8N]NiCl2, where Ar = 2,6-Me2C6H3 in Ni1, 2,6-Et2C6H3 in Ni2, 2,6-i-Pr2C6H3 in Ni3, 2,4,6-Me3C6H2 in Ni4, 2,6-Et2-4-MeC6H2 in Ni5, and 2,4,6-t-Bu3C6H2 in Ni6, has been prepared using a one-pot reaction of 2-(N,N-diethylaminomethyl)-6,7-dihydroquinolin-8(5H)-one with the corresponding aniline and nickel dichloride hexahydrate. The resultant complexes were characterized using elemental analysis and FT-IR spectroscopy, while the mononuclear Ni1 and Ni3 were also the subject of single-crystal X-ray diffraction study. On activation with MMAO, the complexes Ni1–Ni6 displayed good activity in ethylene oligomerization, f…